Degree conditions for 2-factors

نویسندگان

  • Stephan Brandt
  • Guantao Chen
  • Ralph J. Faudree
  • Ronald J. Gould
  • Linda M. Lesniak
چکیده

For any positive integer k, we investigate degree conditions implying that a graph G of order n contains a 2-factor with exactly k components (vertex disjoint cycles). In particular, we prove that for k ≤ (n/4), Ore's classical condition for a graph to be hamiltonian (k = 1) implies that the graph contains a 2-factor with exactly k components. We also obtain a sufficient degree condition for a graph to have k vertex disjoint cycles, at least s of which are 3-cycles and the remaining are 4-cycles for any s ≤ k. c © 1997 John Wiley & Sons, Inc. *Research Supported by Deutsche Forschungsgemeinschaft (DFG) Grant We 1265. †Research Supported by N/S/A Grant MDA 904-94-1-1091. ‡Research Supported by ONR Grant N00014-J-91-1085 and NSA Grant MDA 904-90-H-4034. §Research Supported by ONR Grant N00014-J-91-1085. ¶Research Supported by ONR Grant N00014-J-93-1-0050. Journal of Graph Theory Vol. 24, No. 2, 165 173 (1997) c © 1997 John Wiley & Sons, Inc. CCC 0364-9024/97/020165-09 166 JOURNAL OF GRAPH THEORY

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

متن کامل

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple graphs with a given degree sequence. We then use this result to investigate the maximum number o...

متن کامل

Studying the cohabitation subculture in metropolis Tehran (backgrounds and consequents)

Expended Abstract Introduction: In recent years, new methods of relationship between both sexes have emerged which have no family framework. Today, some girls and boys are living together although they have not got married legally and formally; based on a mutual agreement for an unspecified time. Some scholars express that Iran’s society has faced with increasing waves of changes in values an...

متن کامل

Studying the cohabitation subculture in metropolis Tehran (backgrounds and consequents)

Expended Abstract Introduction: In recent years, new methods of relationship between both sexes have emerged which have no family framework. Today, some girls and boys are living together although they have not got married legally and formally; based on a mutual agreement for an unspecified time. Some scholars express that Iran’s society has faced with increasing waves of changes in values an...

متن کامل

A hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty

The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1997